Computing Igusa's Local Zeta Functions of Univariate Polynomials, and Linear Feedback Shift Registers
نویسنده
چکیده
We give a polynomial time algorithm for computing the Igusa local zeta function Z(s, f) attached to a polynomial f(x) ∈ Z[x], in one variable, with splitting field Q, and a prime number p. We also propose a new class of linear feedback shift registers based on the computation of Igusa’s local zeta function.
منابع مشابه
Local Zeta Functions and Linear Feedback Shift Registers
We give a polynomial time algorithm for computing the Igusa local zeta function Z(s, f) attached to a polynomial f (x) ∈ Z[x], in one variable, with splitting field Q, and a prime number p. We also propose a new class of Linear Feedback Shift Registers based on the computation of Igusa's local zeta function.
متن کاملZeta Functions for Curves and Log Canonical Models
The topological zeta function and Igusa's local zeta function are respectively a geometrical invariant associated to a complex polynomial f and an arithmetical invariant associated to a polynomial f over a p{adic eld. When f is a polynomial in two variables we prove a formula for both zeta functions in terms of the so{called log canonical model of f ?1 f0g in A 2. This result yields moreover a ...
متن کامل0 Fe b 20 06 THE MODULO p AND p 2 CASES OF THE IGUSA CONJECTURE ON EXPONENTIAL SUMS AND THE MOTIVIC OSCILLATION INDEX
— We prove the modulo p and modulo p 2 cases of the Igusa conjecture on exponential sums. This conjecture predicts specific uniform bounds in the homogeneous polynomial case of exponential sums modulo p m when p and m vary. We introduce the motivic oscillation index of a polynomial and prove the possibly stronger, analogue bounds for m = 1, 2 using this index instead of the bounds of the conjec...
متن کاملOn Feedback Functions of Maximum Length Nonlinear Feedback Shift Registers
Feedback shift registers are basic building blocks for many cryptographic primitives. Due to the insecurities of Linear Feedback Shift Register (LFSR) based systems, the use of Nonlinear Feedback Shift Registers (NFSRs) became more popular. In this work, we study the feedback functions of NFSRs with period 2n. First, we provide two new necessary conditions for feedback functions to be maximum l...
متن کاملOn the linear complexity of feedback registers
In this paper, we study sequences generated by arbitrary feedback registers (not necessarily feedback shift registers) with arbitrary feedforward functions. We generalize the definition of linear complexity of a sequence to the notions of strong and weak linear complexity of feedback registers. A technique for finding upper bounds for the strong linear complexities of such registers is develope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.SC/0309050 شماره
صفحات -
تاریخ انتشار 2003